Graph coloring

Results: 948



#Item
221NP-complete problems / Combinatorial optimization / Graph coloring / Matching / Cycle / Bipartite graph / Graph

Almost partitioning any 3-edge-coloured Kn,n into 5 monochromatic cycles Richard Lang, Oliver Schaudt, Maya Stein∗ 30th SeptemberAbstract

Add to Reading List

Source URL: www.zaik.uni-koeln.de

Language: English - Date: 2015-09-30 15:39:15
222Graph theory / Graph coloring / NP-complete problems / Graph operations / Perfect graph theorem / Line graph / Perfect graph / Clique / Bipartite graph / Triangle-free graph / Strong perfect graph theorem / Graph minor

WeilSchaudt_DeltaChi_GaC.dvi

Add to Reading List

Source URL: www.zaik.uni-koeln.de

Language: English - Date: 2014-06-05 05:09:32
223Graph operations / Graph coloring / Chordal graph / Line graph / Split graph / Clique / Forbidden graph characterization / Neighbourhood / Pathwidth / Strongly chordal graph

C:/Users/Oliver/Dropbox/Andrea-Bang-Oliver/split-vs-set-representation/3-sun-free-split-rootsdvi

Add to Reading List

Source URL: www.zaik.uni-koeln.de

Language: English - Date: 2015-02-02 16:29:21
224Graph theory / Graph coloring / Random graph / Triangle-free graph / Extremal graph theory / Interval edge coloring / Line graph

THE TYPICAL STRUCTURE OF SPARSE Kr+1 -FREE GRAPHS arXiv:1307.5967v1 [math.CO] 23 Jul 2013 ´ JOZSEF

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2013-07-23 20:20:52
225Graph theory / Graph coloring / Matroid theory / Register allocation / Graph / Degree / Ear decomposition / Edge contraction / Line graph

Formal Verification of Coalescing Graph-Coloring Register Allocation Sandrine Blazy1 , Benoˆıt Robillard2 , and Andrew W. Appel3 1 IRISA - Universit´e Rennes 1

Add to Reading List

Source URL: www.cs.princeton.edu

Language: English - Date: 2010-01-12 16:36:12
226Graph theory / NP-complete problems / Graph coloring / Graph / Global Positioning System / Random graph

Practical Conflict Graphs for Dynamic Spectrum Distribution Xia Zhou, Zengbin Zhang, Gang Wang, Xiaoxiao Yu§ , Ben Y. Zhao and Haitao Zheng Department of Computer Science, U. C. Santa Barbara, USA § Tsinghua University

Add to Reading List

Source URL: www.cs.ucsb.edu

Language: English - Date: 2013-03-23 01:40:10
227Graph theory / Mathematics / NP-complete problems / Graph coloring / Hypergraph / Dominating set / Ear decomposition / Graph / Line graph / Modular decomposition

A new characterization of Pk -free graphs Eglantine Camby Universit´e Libre de Bruxelles D´epartement de Math´ematique Boulevard du Triomphe, 1050 Brussels, Belgium

Add to Reading List

Source URL: www.zaik.uni-koeln.de

Language: English - Date: 2015-02-09 05:54:36
228

AVOIDING RAINBOW INDUCED SUBGRAPHS IN VERTEX-COLORINGS MARIA AXENOVICH AND RYAN MARTIN Abstract. For a fixed graph H on k vertices, and a graph G on at least k vertices, we write G −→ H if in any vertex-coloring of

Add to Reading List

Source URL: www.math.kit.edu

Language: English - Date: 2015-11-10 14:19:35
    229Graph theory / Graph coloring / Matroid theory / Polynomials / Tutte polynomial / Chromatic polynomial / Matching / Ear decomposition / Spanning tree / Graph / Degree / Connected component

    reg4-n50-c512M-b1M.time.ps

    Add to Reading List

    Source URL: homepages.ecs.vuw.ac.nz

    Language: English - Date: 2008-10-16 17:32:45
    230

    An Application of Stahl’s Conjecture About the k-tuple Chromatic Numbers of Kneser Graphs Svata Poljak and Fred S. Roberts∗ Abstract A k-tuple coloring of a graph G assigns a set of k colors to each vertex of G so th

    Add to Reading List

    Source URL: www.dimacs.rutgers.edu

    Language: English - Date: 2008-07-28 10:11:57
      UPDATE